Krylov subspace methods and minimal residuals
نویسنده
چکیده
We give a concise introduction to some recent developments of Krylov subspace methods (in particular, the method of minimal residuals) and tendencies in the design and analysis of good preconditioners.
منابع مشابه
Residual Replacement Strategies for Krylov
In this paper, a strategy is proposed for alternative computations of the residual vectors in Krylov subspace methods, which improves the agreement of the computed residuals and the true residuals to the level of O(u)kAkkxk. Building on earlier ideas on residual replacement and on insights in the nite precision behaviour of the Krylov subspace methods, computable error bounds are derived for it...
متن کاملDeliberate Ill-conditioning of Krylov Matrices Deliberate Ill-conditioning of Krylov Matrices
This paper starts oo with studying simple extrapolation methods for the classical iteration schemes such as Richardson, Jacobi and Gauss-Seidel iteration. The extrapolation procedures can be interpreted as approximate minimal residual methods in a Krylov subspace. It seems therefore logical to consider, conversely, classical methods as pre-processors for Krylov subspace methods, as was done by ...
متن کاملBlock Krylov Subspace Recycling for Shifted Systems with Unrelated Right-Hand Sides
Many Krylov subspace methods for shifted linear systems take advantage of the invariance of the Krylov subspace under a shift of the matrix. However, exploiting this fact in the non-Hermitian case introduces restrictions; e.g., initial residuals must be collinear and this collinearity must be maintained at restart. Thus we cannot simultaneously solve shifted systems with unrelated right-hand si...
متن کاملHard Cases for Conjugate Gradient Method
The Conjugate Gradient (CG) method is often used to solve a positive definite linear system Ax = b. This paper analyzes two hard cases for CG or any Krylov subspace type methods by either analytically finding the residual formulas or tightly bound the residuals from above and below, in contrast to existing results which only bound residuals from above. The analysis is based on a general framewo...
متن کاملIterative Methods for Linear Systems II: Krylov Methods and Multigrid
Today, we will discuss a class of methods based on repeated applications of the matrix A to some vector (either the residual or the right hand side). These methods are called Krylov methods. We will present two important Krylov methods: the famous Conjugate Gradients method, which can be viewed as an improvement of steepest descent, applicable only to symmetric positive-definite matrices; and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007